Space-Efficient Sampling
نویسندگان
چکیده
We consider the problem of estimating nonparametric probability density functions from a sequence of independent samples. The central issue that we address is to what extent this can be achieved with only limited memory. Our main result is a space-efficient learning algorithm for determining the probability density function of a piecewise-linear distribution. However, the primary goal of this paper is to demonstrate the utility of various techniques from the burgeoning field of data stream processing in the context of learning algorithms.
منابع مشابه
Efficient Sampling from Combinatorial Space via Bridging
MCMC sampling has been extensively studied and used in probabilistic inference. Many algorithms rely on local updates to explore the space, often resulting in slow convergence or failure to mix when there is no path from one set of states to another via local changes. We propose an efficient method for sampling from combinatorial spaces that addresses these issues via “bridging states” that fac...
متن کاملRandom Sampling Based Algorithms for Efficient Semi-Key Discovery
We design efficient random sampling based algorithms for discovering keys and semi-keys in large tables. Given that these problems are provably hard, we adopt the approach of finding approximate solutions to save on time and space requirements. We first propose two natural measures for quantifying the approximation of a semi-key. For the problem of finding minimum keys, we develop efficient alg...
متن کاملGenerating State Lattice Motion Primitives for Differentially Constrained Motion Planning
We propose a method of generating motion primitives for motion planning under differential constraints. These primitives lend themselves particularly well to off-line precomputation. In this manner, they are attractive due to their capacity to capture the mobility constraints of the robot and to establish a state sampling policy that is conducive to efficient search. The first objective allows ...
متن کاملRelationship between Counting and Sampling
This course focuses on Markov chain based algorithms for randomly sampling from probability distributions defined on a large state space. Typically we are interested in generating a sample in time polynomial of the logarithm of the size of the state space. In other words, we want to sample from the distribution after exploring only an exponentially small portion of it. We’ll begin with two clas...
متن کاملGeneralized Sampling with Structural Constraints
We consider a generalized sampling scheme, for finite-dimensional sampling and reconstruction spaces where the correcting transformation must satisfy certain structural constraints. Several criteria are considered, which aim to minimize the squared error norm between the input signal and its approximation within the reconstruction space. By restricting the correcting transformation to a desired...
متن کاملDensity estimation using Real NVP
Unsupervised learning of probabilistic models is a central yet challenging problem in machine learning. Specifically, designing models with tractable learning, sampling, inference and evaluation is crucial in solving this task. We extend the space of such models using real-valued non-volume preserving (real NVP) transformations, a set of powerful, stably invertible, and learnable transformation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007